An Inequality on Guessing and its Application to Sequential Decoding - Information Theory, IEEE Transactions on
نویسنده
چکیده
Let (X, Y) be a pair of discrete random variables with X taking one of M possible values. Suppose the value of X is to be determined, given the value of Y, by asking questions of the form “Is X equal to z?” until the answer is “Yes.” Let G(z 1 y) denote the number of guesses in any such guessing scheme when X = x, Y = y. We prove that
منابع مشابه
Comments on 'An inequality on guessing and its application to sequential decoding'
In the above paper,1 an asymptotically tight upper bound on the th moment ( 0) of the minimal number of guesses required to determine the value of a random variable was derived. We show that we can tighten this bound for the case of positive integer moments (when = 1, the bound is improved by a factor of 2) and that the new bound also applies to a class of nonminimal guessing sequences.
متن کاملAn inequality on guessing and its application to sequential decoding
Let (X, Y) be a pair of discrete random variables with X taking one of M possible values. Suppose the value of X is to be determined, given the value of Y, by asking quest ions of the form “Is X equal to z?” until the answer is “Yes.” Let G(r 1 y) denote the number of guesses in any such guessing scheme when X = x, Y = y. W e prove that 1 1+/J E[G(X IY)‘] 2 (l+InM)-P~ for any p > 0. This provid...
متن کاملJoint Source-Channel Coding and Guessing with Application to Sequential Decoding
We extend our earlier work on guessing subject to distortion to the joint source-channel coding context. We consider a system in which there is a source connected to a destination via a channel and the goal is to reconstruct the source output at the destination within a prescribed distortion level with respect to (w.r.t.) some distortion measure. The decoder is a guessing decoder in the sense t...
متن کاملOn sequential decoding for the Gilbert channel
-It is well-known that the computational performance of sequential decoding deteriorates drastically when channel errors occur in clusters. Hagenauer suggested a feasible modification of sequential decoding which uses a burst-tracking method for better performance. At each step he considers the channel to be memoryless, but with varying probability of error. A different way of using sequential ...
متن کاملConvolutional source encoding
[l] J. M. Wozencraft , “Sequential decoding for reliable communication,” SC. D. dissertation, Dep. Elec. Eng., M.I.T., Cambridge, June 1957. [2] A. J. Viterbi, “Error bounds for convolutional codes and an asymptotically opt imum decoding algorithm,” IEEE Trans. Inform. Theory, vol. IT-13, pp. 260-269, Apr. 1967. [3] R. G. Gallager, Information Theory and Reliable Communicat ion. New York: W ile...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004